ON THE MINIMUM DISTANCE OF SOME BCH CODESCOHEN G.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 3; PP. 363; BIBL. 5 REF.Article

GENERALIZED MINIMUM DISTANCE DECODING ON MAJORITY LOGIC DECODABLE CODESTAI YANG HWANG; SHENG UEI GUAN.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 5; PART. 1; PP. 790-792; BIBL. 9 REF.Article

ON A METHOD FOR ESTABLISHING THE MINIMUM DISTANCE OF ABELIAN CODESPETHO A; REMENYI G.1982; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 2; PP. 97-105; ABS. RUS; BIBL. 5 REF.Article

CASCADED DECODING WITH RESPECT TO MINIMAL GENERALIZED DISTANCEDUMER II; ZINOV'EV VA; ZYABLOV VV et al.1981; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1981; VOL. 10; NO 1; PP. 1.-17; BIBL. 7 REF.; IDEM RUSArticle

ON BOUNDS FOR CODES IN HAMMING SCHEMES AND JOHNSON SCHEMESDE VROEDT C.1980; DELFT PROG. REP.; ISSN 501115; NLD; DA. 1980; VOL. 5; NO 2; PP. 78-91; BIBL. 3 REF.Article

ANALYSIS OF THE COMPUTATIONAL AND STORAGE REQUIREMENTS FOR THE MINIMUM-DISTANCE DECODING OF CONVOLUTIONAL CODESNG WH; GOODMAN RMF.1979; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1979; VOL. 126; NO 1; PP. 29-34; BIBL. 5 REF.Article

CONCATENATED CODES WITH LARGE MINIMUM DISTANCE.LIH JYH WENG.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 5; PP. 613-615; BIBL. 7 REF.Article

A GENERALIZATION OF THE BCH BOUND FOR CYCLIC CODES, INCLUDING THE HARTMANN-TZENG BOUNDROOS C.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 33; NO 2; PP. 229-232; BIBL. 4 REF.Article

HOW TO COMPUTE THE MINIMUM DISTANCE FOR CYCLIC AN-CODES OVER AN ARBITRARY BASE. I: ELEMENTARY METHODSECKER A.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 46; NO 3; PP. 219-240; BIBL. 21 REF.Article

MINIMUM DISTANCE AND ROBUST ESTIMATIONPARR WC; SCHUCANY WR.1980; J. AM. STAT. ASSOC.; ISSN 0003-1291; USA; DA. 1980; VOL. 75; NO 371; PP. 616-624; BIBL. 28 REF.Article

Turbo codes with modified Welch-Costas interleaversTRIFINA, Lucian; MUNTEANU, Valeriu; TARNICERIU, Daniela et al.Annales des télécommunications. 2007, Vol 62, Num 9-10, pp 1045-1052, issn 0003-4347, 8 p.Article

THE MINIMUM DISTANCE METHOD OF TESTINGPOLLARD D.1980; METRIKA; DEU; DA. 1980; VOL. 27; NO 1; PP. 43-70; BIBL. 36 REF.Article

CODES EN BLOCS BINAIRES SATISFAISANT A UNE MATRICE DE DISTANCES MINIMALES DONNEEKISOV VT; DIMOV DT.1979; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1979; VOL. 8; NO 5-6; PP. 403-420; ABS. ENG; BIBL. 5 REF.Article

ECONOMICAL PRACTICAL REALISATION OF MINIMUM-DISTANCE SOFT-DECISION DECODING FOR DATA TRANSMISSION.FARRELL PG; MUNDAY E.sdIN: 1976 INT. ZURICH SEM. DIGITAL COMMUN. INTERACTION BETWEEN CIRCUIT IMPLEMENTATION SYST. DES. PLANN. OPER. USER ASPECTS. PROC.; ZURICH; 1976; ZURICH; IEEE; DA. S.D.; PP. B5.1-B5.6; BIBL. 20 REF.Conference Paper

INDEPENDENT PAIRS OF GOOD SELF-DUAL CODESKANTOR WA.1982; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 6; PP. 966-967; BIBL. 6 REF.Article

ON THE MINIMUM DISTANCE OF A CYCLIC CODEROOS C.1981; DELFT PROGR. REP.; ISSN 0304-985X; NLD; DA. 1981; VOL. 6; NO 3; PP. 165-169; BIBL. 4 REF.Article

GENERALIZED MINIMUM DISTANCE DECODING ALGORITHMS FOR Q ARY OUTPUT CHANNELSYU CCH; COSTELLO DJ JR.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 2; PP. 238-243; BIBL. 11 REF.Article

Measurement of overhead line electrical clearances of importance to the safety of personsSPARROW, L. J; BLACKETT, J. J; JOHNSTONE, C. R et al.IEE conference publication. 1999, pp 3.51.S7-3.54.S7, issn 0537-9989, isbn 0-85296-719-5Conference Paper

On the minimum distance of cyclic codesVAN LINT, J. H; WILSON, R. M.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 23-40, issn 0018-9448Article

Upper bounds on the minimum distance of trellis codesCALDERBANK, A. R; MAZO, J. E; SHAPIRO, H. M et al.The Bell System technical journal. 1983, Vol 62, Num 8, pp 2617-2646, issn 0005-8580Article

Extremal self-dual codes from symmetric designsSPENCE, E; TONCHEV, V. D.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 265-268, issn 0012-365XArticle

Double circulant quadratic residue codesHELLESETH, Tor; VOLOCH, José Felipe.IEEE transactions on information theory. 2004, Vol 50, Num 9, pp 2154-2155, issn 0018-9448, 2 p.Article

Short-cycle-free interleaver design for increasing minimum squared euclidean distanceHOWARD, Sheryl L; ZEINODDIN, Siavash S; SCHLEGEL, Christian et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 54Conference Paper

Duadic codesSMID, M. H. M.IEEE transactions on information theory. 1987, Vol 33, Num 3, pp 432-433, issn 0018-9448Article

The order bound on the minimum distance of the one-point codes associated to the garcia-stichtenoth towerBRAS-AMOROS, Maria; O'SULLIVAN, Michael E.IEEE transactions on information theory. 2007, Vol 53, Num 11, pp 4241-4245, issn 0018-9448, 5 p.Article